Why the usual candidates of reducibility do not work for the symmetric λμ-calculus
نویسندگان
چکیده
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ, which is the symmetric of μ, is added. We give examples explaining why the technique using the usual candidates of reducibility does not work. We also prove a standardization theorem for this calculus.
منابع مشابه
Arithmetical proofs of strong normalization results for the symmetric λμ-calculus
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong normalization results for this calculus. We show (this is a new result) that the μμ′-reduction is strongly normalizing for the un-typed calculus. We also show the strong normalization of the βμμ′-reduction for the ty...
متن کامل7 M ay 2 00 9 Arithmetical proofs of strong normalization results for the symmetric λ μ - calculus
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong normalization results for this calculus. We show (this is a new result) that the μμ′-reduction is strongly normalizing for the un-typed calculus. We also show the strong normalization of the βμμ′-reduction for the ty...
متن کاملStrong Normalization of λμμ̃-Calculus with Explicit Substitutions
The λμμ̃-calculus, defined by Curien and Herbelin [7], is a variant of the λμ-calculus that exhibits symmetries such as term/context and call-by-name/call-by-value. Since it is a symmetric, and hence a non-deterministic calculus, usual proof techniques of normalization needs some adjustments to be made to work in this setting. Here we prove the strong normalization (SN) of simply typed λμμ̃-calcu...
متن کاملArithmetical proofs of strong normalization results for symmetric lambda calculi
We give arithmetical proofs of the strong normalization of two symmetric λ-calculi corresponding to classical logic. The first one is the λμμ̃-calculus introduced by Curien & Herbelin. It is derived via the Curry-Howard correspondence from Gentzen’s classical sequent calculus LK in order to have a symmetry on one side between “program” and “context” and on other side between “call-by-name” and “...
متن کاملArithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi
We give arithmetical proofs of the strong normalization of two symmetric λ-calculi corresponding to classical logic. The first one is the λμμ̃-calculus introduced by Curien & Herbelin. It is derived via the Curry-Howard correspondence from Gentzen’s classical sequent calculus LK in order to have a symmetry on one side between “program” and “context” and on other side between “call-by-name” and “...
متن کامل